Moderate-density Burst Error Correcting Linear Codes

نویسندگان

  • Bal Kishan Dass
  • Gangmei Sobha
چکیده

It is well known that during the process of transmission errors occur predominantly in the form of a burst. However, it does not generally happen that all the digits inside any burst length get corrupted. Also when burst length is large then the actual number of errors inside the burst length is also not very less. Keeping this in view, we study codes which detect/correct moderate-density burst errors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blockwise Repeated Low - Density Burst Error Correcting Linear Codes

The paper presents necessary and sufficient condition on the number of parity-check digits required for the existence of a linear code capable of correcting errors in the form of 2-repeated low-density bursts occurring within a sub-block. An illustration of a code of length 24 correcting all 2-repeated low-density bursts of length 3 or less with weight 2 or less occurring within a sub-block of ...

متن کامل

On 2-Repeated Burst Codes

There are several kinds of burst errors for which error detecting and error correcting codes have been constructed. In this paper, we consider a new kind of burst error which will be termed as ‘2-repeated burst error of length b(fixed)’. Linear codes capable of detecting such errors have been studied. Further, codes capable of detecting and simultaneously correcting such errors have also been d...

متن کامل

Blockwise Solid Burst Error Correcting Codes

This paper presents a lower and upper bound for linear codes which are capable of correcting errors in the form of solid burst of different lengths within different sub blocks. An illustration of such kind of codes has also been provided.

متن کامل

A Lower Bound for Codes Correcting Low Density Closed-Loop Burst

In this paper, we present a lower bound for low density closed loop burst error correcting code in two sub-blocks of length 1 n and 2 n of the total code length 1 2 ( ) n n n n   . Keywords-Open loop burst, Closed loop burst, Parity check matrix,Syndromes, Error correction.

متن کامل

Microsoft Word - Burst-and-Random-Error-Code-Evaluation

Markov chains are a popular means to capture correlated random processes for characterization and analysis of error pattern or bursty traffic in data transmission. The performance evaluation of communication protocols based on Markov models is tractable with limited state space and often depends on efficient implementation. Simulation or other methods have to be adopted for system of higher com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004